Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar14/ZantemaSLASHz05.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(a, f₂(a, x)) -> f₂(c, f₂(b, x))
f₂(b, f₂(b, x)) -> f₂(a, f₂(c, x))
f₂(c, f₂(c, x)) -> f₂(b, f₂(a, x))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(a, f₂(a, x)) -> f₂(c, f₂(b, x))
f₂(b, f₂(b, x)) -> f₂(a, f₂(c, x))
f₂(c, f₂(c, x)) -> f₂(b, f₂(a, x))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₂(a, f₂(a, x)) -> F₂(b, x)
F₂(c, f₂(c, x)) -> F₂(a, x)
F₂(a, f₂(a, x)) -> F₂(c, f₂(b, x))
F₂(b, f₂(b, x)) -> F₂(a, f₂(c, x))
F₂(c, f₂(c, x)) -> F₂(b, f₂(a, x))
F₂(b, f₂(b, x)) -> F₂(c, x)

The TRS R consists of the following rules:

f₂(a, f₂(a, x)) -> f₂(c, f₂(b, x))
f₂(b, f₂(b, x)) -> f₂(a, f₂(c, x))
f₂(c, f₂(c, x)) -> f₂(b, f₂(a, x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F₂(a, f₂(a, x)) -> F₂(b, x)
F₂(c, f₂(c, x)) -> F₂(a, x)
F₂(a, f₂(a, x)) -> F₂(c, f₂(b, x))
F₂(b, f₂(b, x)) -> F₂(a, f₂(c, x))
F₂(c, f₂(c, x)) -> F₂(b, f₂(a, x))
F₂(b, f₂(b, x)) -> F₂(c, x)

The TRS R consists of the following rules:

f₂(a, f₂(a, x)) -> f₂(c, f₂(b, x))
f₂(b, f₂(b, x)) -> f₂(a, f₂(c, x))
f₂(c, f₂(c, x)) -> f₂(b, f₂(a, x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₂(a, f₂(a, x)) -> F₂(b, x)
F₂(c, f₂(c, x)) -> F₂(a, x)
F₂(b, f₂(b, x)) -> F₂(c, x)

The remaining pairs can at least by weakly be oriented.

F₂(a, f₂(a, x)) -> F₂(c, f₂(b, x))
F₂(b, f₂(b, x)) -> F₂(a, f₂(c, x))
F₂(c, f₂(c, x)) -> F₂(b, f₂(a, x))

Used ordering: Combined order from the following AFS and order.
F₂(x1, x2) = F₁(x2)
a = a
f₂(x1, x2) = f₁(x2)
b = b
c = c

Lexicographic Path Order [19].
Precedence:

[F₁, a, f_1] > c > b

The following usable rules [14] were oriented:

f₂(c, f₂(c, x)) -> f₂(b, f₂(a, x))
f₂(a, f₂(a, x)) -> f₂(c, f₂(b, x))
f₂(b, f₂(b, x)) -> f₂(a, f₂(c, x))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₂(a, f₂(a, x)) -> F₂(c, f₂(b, x))
F₂(b, f₂(b, x)) -> F₂(a, f₂(c, x))
F₂(c, f₂(c, x)) -> F₂(b, f₂(a, x))

The TRS R consists of the following rules:

f₂(a, f₂(a, x)) -> f₂(c, f₂(b, x))
f₂(b, f₂(b, x)) -> f₂(a, f₂(c, x))
f₂(c, f₂(c, x)) -> f₂(b, f₂(a, x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.